The Complexity of Two-dimensional Compressed Pattern Matching

نویسندگان

  • Piotr Berman
  • Marek Karpinski
  • Lawrence L. Larmore
چکیده

We study computational complexity of two-dimensional compressed pattern matching problems. Among other things, we design an eecient randomized algorithm for the equality problem of two compressed two-dimensional patterns as well as prove computational hardness of the general two-dimensional compressed pattern matching .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Complexity of Two - DimensionalCompressed Pattern -

We consider the complexity of problems for highly compressed 2-dimensional texts: compressed pattern-matching (when the pattern is not compressed and the text is compressed) and fully compressed pattern-matching (when also the pattern is compressed). First we consider 2-dimensional compression in terms of straight-line programs, see 9]. It is a natural way for representing very highly compresse...

متن کامل

On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts

We consider the complexity of problems related to 2-dimensional texts (2d-texts) described succinctly. In a succinct description, larger rectangular sub-texts are deened in terms of smaller parts in a way similar to that of Lempel-Ziv compression for 1-dimensional texts, or in shortly described strings as in 9], or in hierarchical graphs described by context-free graph grammars. A given 2d-text...

متن کامل

Pattern - Matching Problems for

The power of weighted nite automata to describe very complex images was widely studied, see [5, 6, 7]. Finite automata can be also used as an e ective tool for compression of twodimensional images. There are some software packages using this type of compression, see [12, 6]. We consider the complexity of some pattern-matching problems for two-dimensional images which are highly compressed using...

متن کامل

Neighborhood matrix: A new idea in matching of two dimensional gel images

Automated data analysis and pattern recognition techniques are the requirements of biological and proteomicsresearch studies. The analysis of proteins consists of some stages among which the analysis of two dimensionalelectrophoresis (2-DE) images is crucial. The aim of image capturing is to generate a Photostat that can be used infuture works such as image comparison. The researchers introduce...

متن کامل

JPEG-LS Based Two-Dimensional Compressed Pattern Matching

With the phenomenal advances in data acquisition techniques via satellites and in medical diagnostics and forensic sciences, we have encountered a massive growth of image data. On account of efficiency (in terms of both space and time), there is a need to keep the data in compressed form for as much as possible, even when it is being searched. The class of images we are concerned in this paper ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996